<!DOCTYPE html>
<html lang="zh-CN">
    <head>
        <meta charset="utf-8">
        <meta name="viewport" content="width=device-width, initial-scale=1">
        <meta name="robots" content="noodp" />
        <meta http-equiv="X-UA-Compatible" content="IE=edge, chrome=1">
        <title>01_finalshell密码破解 - 山脚下的脚下山</title><meta name="Description" content="山脚下の脚下山"><meta property="og:title" content="01_finalshell密码破解" />
<meta property="og:description" content="java解密代码如下： 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59" />
<meta property="og:type" content="article" />
<meta property="og:url" content="https://scemsjyd.com/finalshell%E8%A7%A3%E5%AF%86/" /><meta property="og:image" content="https://scemsjyd.com/logo.png"/><meta property="article:section" content="posts" />
<meta property="article:published_time" content="2016-10-27T15:58:21+08:00" />
<meta property="article:modified_time" content="2016-10-27T15:58:21+08:00" />

<meta name="twitter:card" content="summary_large_image"/>
<meta name="twitter:image" content="https://scemsjyd.com/logo.png"/>

<meta name="twitter:title" content="01_finalshell密码破解"/>
<meta name="twitter:description" content="java解密代码如下： 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59"/>
<meta name="application-name" content="山脚下の脚下山">
<meta name="apple-mobile-web-app-title" content="山脚下の脚下山"><meta name="theme-color" content="#ffffff"><meta name="msapplication-TileColor" content="#da532c"><link rel="shortcut icon" type="image/x-icon" href="/favicon.ico" />
        <link rel="icon" type="image/png" sizes="32x32" href="/favicon-32x32.png">
        <link rel="icon" type="image/png" sizes="16x16" href="/favicon-16x16.png"><link rel="apple-touch-icon" sizes="180x180" href="/apple-touch-icon.png"><link rel="mask-icon" href="/safari-pinned-tab.svg" color="#5bbad5"><link rel="manifest" href="/site.webmanifest"><link rel="canonical" href="https://scemsjyd.com/finalshell%E8%A7%A3%E5%AF%86/" /><link rel="prev" href="https://scemsjyd.com/navicat%E8%A7%A3%E5%AF%86/" /><link rel="next" href="https://scemsjyd.com/06_springmvc_validator/" /><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/normalize.css@8.0.1/normalize.min.css"><link rel="stylesheet" href="/css/style.min.css"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/@fortawesome/fontawesome-free@5.13.0/css/all.min.css"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/animate.css@3.7.2/animate.min.css"><script type="application/ld+json">
    {
        "@context": "http://schema.org",
        "@type": "BlogPosting",
        "headline": "01_finalshell密码破解",
        "inLanguage": "zh-CN",
        "mainEntityOfPage": {
            "@type": "WebPage",
            "@id": "https:\/\/scemsjyd.com\/finalshell%E8%A7%A3%E5%AF%86\/"
        },"image": ["https:\/\/scemsjyd.com\/images\/Apple-Devices-Preview.png"],"genre": "posts","keywords": "finalshell","wordcount":  1331 ,
        "url": "https:\/\/scemsjyd.com\/finalshell%E8%A7%A3%E5%AF%86\/","datePublished": "2016-10-27T15:58:21+08:00","dateModified": "2016-10-27T15:58:21+08:00","license": "This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.","publisher": {
            "@type": "Organization",
            "name": "Adam.Jin","logo": "https:\/\/p.qlogo.cn\/bizmail\/XpHAlE90tNCBxpvcMjtmdG52qxW6TFrUQ3VbWchBMibqlYJup0yhBzQ\/"},"author": {
                "@type": "Person",
                "name": "山脚下的脚下山"
            },"description": ""
    }
    </script></head>
    <body header-desktop="fixed" header-mobile="auto"><script type="text/javascript">(window.localStorage && localStorage.getItem('theme') ? localStorage.getItem('theme') === 'dark' : ('auto' === 'auto' ? window.matchMedia('(prefers-color-scheme: dark)').matches : 'auto' === 'dark')) && document.body.setAttribute('theme', 'dark');</script>

        <div id="mask"></div><div class="wrapper"><header class="desktop" id="header-desktop">
    <div class="header-wrapper">
        <div class="header-title">
            <a href="/" title="山脚下的脚下山"><span class="header-title-pre"><i class='far fa-kiss-wink-heart fa-fw'></i></span>山脚下の脚下山</a>
        </div>
        <div class="menu">
            <div class="menu-inner"><a class="menu-item" href="/"> 主页 </a><a class="menu-item" href="/posts/"> 文章 </a><a class="menu-item" href="/tags/"> 标签 </a><a class="menu-item" href="/categories/"> 分类 </a><a class="menu-item" href="/about/"> 关于 </a><a class="menu-item" href="https://github.com/scemsjyd" title="GitHub" rel="noopener noreffer" target="_blank"><i class='fab fa-github fa-fw'></i>  </a><span class="menu-item delimiter"></span><span class="menu-item search" id="search-desktop">
                        <input type="text" placeholder="搜索文章标题或内容..." id="search-input-desktop">
                        <a href="javascript:void(0);" class="search-button search-toggle" id="search-toggle-desktop" title="搜索">
                            <i class="fas fa-search fa-fw"></i>
                        </a>
                        <a href="javascript:void(0);" class="search-button search-clear" id="search-clear-desktop" title="清空">
                            <i class="fas fa-times-circle fa-fw"></i>
                        </a>
                        <span class="search-button search-loading" id="search-loading-desktop">
                            <i class="fas fa-spinner fa-fw fa-spin"></i>
                        </span>
                    </span><a href="javascript:void(0);" class="menu-item theme-switch" title="切换主题">
                    <i class="fas fa-adjust fa-fw"></i>
                </a>
            </div>
        </div>
    </div>
</header><header class="mobile" id="header-mobile">
    <div class="header-container">
        <div class="header-wrapper">
            <div class="header-title">
                <a href="/" title="山脚下的脚下山"><span class="header-title-pre"><i class='far fa-kiss-wink-heart fa-fw'></i></span>山脚下の脚下山</a>
            </div>
            <div class="menu-toggle" id="menu-toggle-mobile">
                <span></span><span></span><span></span>
            </div>
        </div>
        <div class="menu" id="menu-mobile"><div class="search-wrapper">
                    <div class="search mobile" id="search-mobile">
                        <input type="text" placeholder="搜索文章标题或内容..." id="search-input-mobile">
                        <a href="javascript:void(0);" class="search-button search-toggle" id="search-toggle-mobile" title="搜索">
                            <i class="fas fa-search fa-fw"></i>
                        </a>
                        <a href="javascript:void(0);" class="search-button search-clear" id="search-clear-mobile" title="清空">
                            <i class="fas fa-times-circle fa-fw"></i>
                        </a>
                        <span class="search-button search-loading" id="search-loading-mobile">
                            <i class="fas fa-spinner fa-fw fa-spin"></i>
                        </span>
                    </div>
                    <a href="javascript:void(0);" class="search-cancel" id="search-cancel-mobile">
                        取消
                    </a>
                </div><a class="menu-item" href="/" title="">主页</a><a class="menu-item" href="/posts/" title="">文章</a><a class="menu-item" href="/tags/" title="">标签</a><a class="menu-item" href="/categories/" title="">分类</a><a class="menu-item" href="/about/" title="">关于</a><a class="menu-item" href="https://github.com/scemsjyd" title="GitHub" rel="noopener noreffer" target="_blank"><i class='fab fa-github fa-fw'></i></a><a href="javascript:void(0);" class="menu-item theme-switch" title="切换主题">
                <i class="fas fa-adjust fa-fw"></i>
            </a></div>
    </div>
</header>
<div class="search-dropdown desktop">
    <div id="search-dropdown-desktop"></div>
</div>
<div class="search-dropdown mobile">
    <div id="search-dropdown-mobile"></div>
</div>
<main class="main">
                <div class="container"><div class="toc" id="toc-auto">
            <h2 class="toc-title">目录</h2>
            <div class="toc-content" id="toc-content-auto"></div>
        </div><article class="page single"><h1 class="single-title animated flipInX">01_finalshell密码破解</h1><div class="post-meta">
            <div class="post-meta-line"><span class="post-author"><a href="/" title="Author" rel=" author" class="author"><i class="fas fa-user-circle fa-fw"></i>山脚下的脚下山</a></span>&nbsp;<span class="post-category">收录于 <a href="/categories/%E5%B7%A5%E5%85%B7/"><i class="far fa-folder fa-fw"></i>工具</a></span></div>
            <div class="post-meta-line"><i class="far fa-calendar-alt fa-fw"></i>&nbsp;<time datetime="2016-10-27">2016-10-27</time>&nbsp;<i class="fas fa-pencil-alt fa-fw"></i>&nbsp;约 1331 字&nbsp;
                <i class="far fa-clock fa-fw"></i>&nbsp;预计阅读 3 分钟&nbsp;<span id="/finalshell%E8%A7%A3%E5%AF%86/" class="leancloud_visitors" data-flag-title="01_finalshell密码破解">
                        <i class="far fa-eye fa-fw"></i>&nbsp;<span class=leancloud-visitors-count></span>&nbsp;次阅读
                    </span>&nbsp;</div>
        </div><div class="details toc" id="toc-static"  kept="">
                <div class="details-summary toc-title">
                    <span>目录</span>
                    <span><i class="details-icon fas fa-angle-right"></i></span>
                </div>
                <div class="details-content toc-content" id="toc-content-static"><nav id="TableOfContents"></nav></div>
            </div><div class="content" id="content"><p>java解密代码如下：</p>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt">  1
</span><span class="lnt">  2
</span><span class="lnt">  3
</span><span class="lnt">  4
</span><span class="lnt">  5
</span><span class="lnt">  6
</span><span class="lnt">  7
</span><span class="lnt">  8
</span><span class="lnt">  9
</span><span class="lnt"> 10
</span><span class="lnt"> 11
</span><span class="lnt"> 12
</span><span class="lnt"> 13
</span><span class="lnt"> 14
</span><span class="lnt"> 15
</span><span class="lnt"> 16
</span><span class="lnt"> 17
</span><span class="lnt"> 18
</span><span class="lnt"> 19
</span><span class="lnt"> 20
</span><span class="lnt"> 21
</span><span class="lnt"> 22
</span><span class="lnt"> 23
</span><span class="lnt"> 24
</span><span class="lnt"> 25
</span><span class="lnt"> 26
</span><span class="lnt"> 27
</span><span class="lnt"> 28
</span><span class="lnt"> 29
</span><span class="lnt"> 30
</span><span class="lnt"> 31
</span><span class="lnt"> 32
</span><span class="lnt"> 33
</span><span class="lnt"> 34
</span><span class="lnt"> 35
</span><span class="lnt"> 36
</span><span class="lnt"> 37
</span><span class="lnt"> 38
</span><span class="lnt"> 39
</span><span class="lnt"> 40
</span><span class="lnt"> 41
</span><span class="lnt"> 42
</span><span class="lnt"> 43
</span><span class="lnt"> 44
</span><span class="lnt"> 45
</span><span class="lnt"> 46
</span><span class="lnt"> 47
</span><span class="lnt"> 48
</span><span class="lnt"> 49
</span><span class="lnt"> 50
</span><span class="lnt"> 51
</span><span class="lnt"> 52
</span><span class="lnt"> 53
</span><span class="lnt"> 54
</span><span class="lnt"> 55
</span><span class="lnt"> 56
</span><span class="lnt"> 57
</span><span class="lnt"> 58
</span><span class="lnt"> 59
</span><span class="lnt"> 60
</span><span class="lnt"> 61
</span><span class="lnt"> 62
</span><span class="lnt"> 63
</span><span class="lnt"> 64
</span><span class="lnt"> 65
</span><span class="lnt"> 66
</span><span class="lnt"> 67
</span><span class="lnt"> 68
</span><span class="lnt"> 69
</span><span class="lnt"> 70
</span><span class="lnt"> 71
</span><span class="lnt"> 72
</span><span class="lnt"> 73
</span><span class="lnt"> 74
</span><span class="lnt"> 75
</span><span class="lnt"> 76
</span><span class="lnt"> 77
</span><span class="lnt"> 78
</span><span class="lnt"> 79
</span><span class="lnt"> 80
</span><span class="lnt"> 81
</span><span class="lnt"> 82
</span><span class="lnt"> 83
</span><span class="lnt"> 84
</span><span class="lnt"> 85
</span><span class="lnt"> 86
</span><span class="lnt"> 87
</span><span class="lnt"> 88
</span><span class="lnt"> 89
</span><span class="lnt"> 90
</span><span class="lnt"> 91
</span><span class="lnt"> 92
</span><span class="lnt"> 93
</span><span class="lnt"> 94
</span><span class="lnt"> 95
</span><span class="lnt"> 96
</span><span class="lnt"> 97
</span><span class="lnt"> 98
</span><span class="lnt"> 99
</span><span class="lnt">100
</span><span class="lnt">101
</span><span class="lnt">102
</span><span class="lnt">103
</span><span class="lnt">104
</span><span class="lnt">105
</span><span class="lnt">106
</span><span class="lnt">107
</span><span class="lnt">108
</span><span class="lnt">109
</span><span class="lnt">110
</span><span class="lnt">111
</span><span class="lnt">112
</span><span class="lnt">113
</span><span class="lnt">114
</span><span class="lnt">115
</span><span class="lnt">116
</span><span class="lnt">117
</span><span class="lnt">118
</span><span class="lnt">119
</span><span class="lnt">120
</span><span class="lnt">121
</span><span class="lnt">122
</span><span class="lnt">123
</span><span class="lnt">124
</span><span class="lnt">125
</span><span class="lnt">126
</span><span class="lnt">127
</span><span class="lnt">128
</span><span class="lnt">129
</span><span class="lnt">130
</span><span class="lnt">131
</span><span class="lnt">132
</span><span class="lnt">133
</span><span class="lnt">134
</span><span class="lnt">135
</span><span class="lnt">136
</span><span class="lnt">137
</span><span class="lnt">138
</span><span class="lnt">139
</span><span class="lnt">140
</span><span class="lnt">141
</span><span class="lnt">142
</span><span class="lnt">143
</span><span class="lnt">144
</span><span class="lnt">145
</span><span class="lnt">146
</span><span class="lnt">147
</span><span class="lnt">148
</span><span class="lnt">149
</span><span class="lnt">150
</span><span class="lnt">151
</span><span class="lnt">152
</span><span class="lnt">153
</span><span class="lnt">154
</span><span class="lnt">155
</span><span class="lnt">156
</span><span class="lnt">157
</span><span class="lnt">158
</span><span class="lnt">159
</span><span class="lnt">160
</span><span class="lnt">161
</span><span class="lnt">162
</span><span class="lnt">163
</span><span class="lnt">164
</span><span class="lnt">165
</span><span class="lnt">166
</span><span class="lnt">167
</span><span class="lnt">168
</span><span class="lnt">169
</span><span class="lnt">170
</span><span class="lnt">171
</span><span class="lnt">172
</span><span class="lnt">173
</span><span class="lnt">174
</span><span class="lnt">175
</span><span class="lnt">176
</span><span class="lnt">177
</span><span class="lnt">178
</span><span class="lnt">179
</span><span class="lnt">180
</span><span class="lnt">181
</span><span class="lnt">182
</span><span class="lnt">183
</span><span class="lnt">184
</span><span class="lnt">185
</span><span class="lnt">186
</span><span class="lnt">187
</span><span class="lnt">188
</span><span class="lnt">189
</span><span class="lnt">190
</span><span class="lnt">191
</span><span class="lnt">192
</span><span class="lnt">193
</span><span class="lnt">194
</span><span class="lnt">195
</span><span class="lnt">196
</span><span class="lnt">197
</span><span class="lnt">198
</span><span class="lnt">199
</span><span class="lnt">200
</span><span class="lnt">201
</span><span class="lnt">202
</span><span class="lnt">203
</span><span class="lnt">204
</span><span class="lnt">205
</span><span class="lnt">206
</span><span class="lnt">207
</span><span class="lnt">208
</span><span class="lnt">209
</span><span class="lnt">210
</span><span class="lnt">211
</span><span class="lnt">212
</span><span class="lnt">213
</span><span class="lnt">214
</span><span class="lnt">215
</span><span class="lnt">216
</span><span class="lnt">217
</span><span class="lnt">218
</span><span class="lnt">219
</span><span class="lnt">220
</span><span class="lnt">221
</span><span class="lnt">222
</span><span class="lnt">223
</span><span class="lnt">224
</span><span class="lnt">225
</span><span class="lnt">226
</span><span class="lnt">227
</span><span class="lnt">228
</span><span class="lnt">229
</span><span class="lnt">230
</span><span class="lnt">231
</span><span class="lnt">232
</span><span class="lnt">233
</span><span class="lnt">234
</span><span class="lnt">235
</span><span class="lnt">236
</span><span class="lnt">237
</span><span class="lnt">238
</span><span class="lnt">239
</span><span class="lnt">240
</span><span class="lnt">241
</span><span class="lnt">242
</span><span class="lnt">243
</span><span class="lnt">244
</span><span class="lnt">245
</span><span class="lnt">246
</span><span class="lnt">247
</span><span class="lnt">248
</span><span class="lnt">249
</span><span class="lnt">250
</span><span class="lnt">251
</span><span class="lnt">252
</span><span class="lnt">253
</span><span class="lnt">254
</span><span class="lnt">255
</span><span class="lnt">256
</span><span class="lnt">257
</span><span class="lnt">258
</span><span class="lnt">259
</span><span class="lnt">260
</span><span class="lnt">261
</span><span class="lnt">262
</span><span class="lnt">263
</span><span class="lnt">264
</span><span class="lnt">265
</span><span class="lnt">266
</span><span class="lnt">267
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-java" data-lang="java"><span class="c1">//
</span><span class="c1">// Source code recreated from a .class file by IntelliJ IDEA
</span><span class="c1">// (powered by Fernflower decompiler)
</span><span class="c1">//
</span><span class="c1"></span>
<span class="kn">package</span> <span class="nn">com.test</span><span class="o">;</span>

<span class="kn">import</span> <span class="nn">org.apache.commons.codec.digest.DigestUtils</span><span class="o">;</span>

<span class="kn">import</span> <span class="nn">javax.crypto.Cipher</span><span class="o">;</span>
<span class="kn">import</span> <span class="nn">javax.crypto.SecretKey</span><span class="o">;</span>
<span class="kn">import</span> <span class="nn">javax.crypto.SecretKeyFactory</span><span class="o">;</span>
<span class="kn">import</span> <span class="nn">javax.crypto.spec.DESKeySpec</span><span class="o">;</span>
<span class="kn">import</span> <span class="nn">java.io.ByteArrayOutputStream</span><span class="o">;</span>
<span class="kn">import</span> <span class="nn">java.io.DataOutputStream</span><span class="o">;</span>
<span class="kn">import</span> <span class="nn">java.io.IOException</span><span class="o">;</span>
<span class="kn">import</span> <span class="nn">java.io.UnsupportedEncodingException</span><span class="o">;</span>
<span class="kn">import</span> <span class="nn">java.security.SecureRandom</span><span class="o">;</span>
<span class="kn">import</span> <span class="nn">java.util.Random</span><span class="o">;</span>

<span class="kd">public</span> <span class="kd">class</span> <span class="nc">Test</span> <span class="o">{</span>
<span class="c1">//    private static final String OO0O00OO00OOOOOO0000O0O000O0O0000OOOO00OO000OO0000OO000000O00O0O000OO00O0O000O00O0O00OOOOOO0OOO0 = &#34;DES&#34;;
</span><span class="c1"></span>    <span class="kd">public</span> <span class="kd">static</span> <span class="kt">long</span> <span class="n">number</span> <span class="o">=</span> <span class="n">3680984568597093857L</span><span class="o">;</span>
    <span class="kd">private</span> <span class="kd">static</span> <span class="kt">int</span> <span class="n">num</span> <span class="o">=</span> <span class="n">8</span><span class="o">;</span>



    <span class="kd">public</span> <span class="kd">static</span> <span class="kt">void</span> <span class="nf">main</span><span class="o">(</span><span class="n">String</span><span class="o">[]</span> <span class="n">args</span><span class="o">)</span> <span class="kd">throws</span> <span class="n">Exception</span> <span class="o">{</span>
        <span class="n">String</span> <span class="n">content</span> <span class="o">=</span> <span class="s">&#34;sdsfew1tf45r1g3&#34;</span><span class="o">;</span>
        <span class="n">String</span> <span class="n">s1</span> <span class="o">=</span> <span class="n">encode</span><span class="o">(</span><span class="n">content</span><span class="o">);</span>
        <span class="n">String</span> <span class="n">s2</span> <span class="o">=</span> <span class="n">decode</span><span class="o">(</span><span class="n">s1</span><span class="o">);</span>
        <span class="n">System</span><span class="o">.</span><span class="na">out</span><span class="o">.</span><span class="na">println</span><span class="o">(</span><span class="n">s1</span><span class="o">);</span>
        <span class="n">System</span><span class="o">.</span><span class="na">out</span><span class="o">.</span><span class="na">println</span><span class="o">(</span><span class="n">s2</span><span class="o">);</span>
    <span class="o">}</span>

    <span class="kd">public</span> <span class="kd">static</span> <span class="n">String</span> <span class="nf">decode</span><span class="o">(</span><span class="n">String</span> <span class="n">data</span><span class="o">)</span> <span class="kd">throws</span> <span class="n">IOException</span><span class="o">,</span> <span class="n">Exception</span> <span class="o">{</span>
        <span class="k">if</span> <span class="o">(</span><span class="n">data</span> <span class="o">==</span> <span class="kc">null</span><span class="o">)</span> <span class="o">{</span>
            <span class="k">return</span> <span class="kc">null</span><span class="o">;</span>
        <span class="o">}</span> <span class="k">else</span> <span class="o">{</span>
            <span class="n">String</span> <span class="n">rs</span> <span class="o">=</span> <span class="s">&#34;&#34;</span><span class="o">;</span>
            <span class="k">if</span> <span class="o">(!</span><span class="n">fff</span><span class="o">(</span><span class="n">data</span><span class="o">))</span> <span class="o">{</span>
                <span class="kt">byte</span><span class="o">[]</span> <span class="n">buf</span> <span class="o">=</span> <span class="n">ggg</span><span class="o">(</span><span class="n">data</span><span class="o">);</span>
                <span class="kt">byte</span><span class="o">[]</span> <span class="n">head</span> <span class="o">=</span> <span class="k">new</span> <span class="kt">byte</span><span class="o">[</span><span class="n">num</span><span class="o">];</span>
                <span class="n">System</span><span class="o">.</span><span class="na">arraycopy</span><span class="o">(</span><span class="n">buf</span><span class="o">,</span> <span class="n">0</span><span class="o">,</span> <span class="n">head</span><span class="o">,</span> <span class="n">0</span><span class="o">,</span> <span class="n">head</span><span class="o">.</span><span class="na">length</span><span class="o">);</span>
                <span class="kt">byte</span><span class="o">[]</span> <span class="n">d</span> <span class="o">=</span> <span class="k">new</span> <span class="kt">byte</span><span class="o">[</span><span class="n">buf</span><span class="o">.</span><span class="na">length</span> <span class="o">-</span> <span class="n">head</span><span class="o">.</span><span class="na">length</span><span class="o">];</span>
                <span class="n">System</span><span class="o">.</span><span class="na">arraycopy</span><span class="o">(</span><span class="n">buf</span><span class="o">,</span> <span class="n">head</span><span class="o">.</span><span class="na">length</span><span class="o">,</span> <span class="n">d</span><span class="o">,</span> <span class="n">0</span><span class="o">,</span> <span class="n">d</span><span class="o">.</span><span class="na">length</span><span class="o">);</span>
                <span class="kt">byte</span><span class="o">[]</span> <span class="n">bt</span> <span class="o">=</span> <span class="n">jjj</span><span class="o">(</span><span class="n">d</span><span class="o">,</span> <span class="n">kkk</span><span class="o">(</span><span class="n">head</span><span class="o">));</span>
                <span class="n">rs</span> <span class="o">=</span> <span class="k">new</span> <span class="n">String</span><span class="o">(</span><span class="n">bt</span><span class="o">);</span>
            <span class="o">}</span>

            <span class="k">return</span> <span class="n">rs</span><span class="o">;</span>
        <span class="o">}</span>
    <span class="o">}</span>

    <span class="kd">public</span> <span class="kd">static</span> <span class="n">String</span> <span class="nf">encode</span><span class="o">(</span><span class="n">String</span> <span class="n">content</span><span class="o">)</span> <span class="kd">throws</span> <span class="n">Exception</span> <span class="o">{</span>
        <span class="kt">byte</span><span class="o">[]</span> <span class="n">head</span> <span class="o">=</span> <span class="n">aaa</span><span class="o">(</span><span class="n">num</span><span class="o">);</span>
        <span class="kt">byte</span><span class="o">[]</span> <span class="n">d</span> <span class="o">=</span> <span class="n">bbb</span><span class="o">(</span><span class="n">content</span><span class="o">.</span><span class="na">getBytes</span><span class="o">(</span><span class="s">&#34;utf-8&#34;</span><span class="o">),</span> <span class="n">head</span><span class="o">);</span>
        <span class="kt">byte</span><span class="o">[]</span> <span class="n">result</span> <span class="o">=</span> <span class="k">new</span> <span class="kt">byte</span><span class="o">[</span><span class="n">head</span><span class="o">.</span><span class="na">length</span> <span class="o">+</span> <span class="n">d</span><span class="o">.</span><span class="na">length</span><span class="o">];</span>
        <span class="n">System</span><span class="o">.</span><span class="na">arraycopy</span><span class="o">(</span><span class="n">head</span><span class="o">,</span> <span class="n">0</span><span class="o">,</span> <span class="n">result</span><span class="o">,</span> <span class="n">0</span><span class="o">,</span> <span class="n">head</span><span class="o">.</span><span class="na">length</span><span class="o">);</span>
        <span class="n">System</span><span class="o">.</span><span class="na">arraycopy</span><span class="o">(</span><span class="n">d</span><span class="o">,</span> <span class="n">0</span><span class="o">,</span> <span class="n">result</span><span class="o">,</span> <span class="n">head</span><span class="o">.</span><span class="na">length</span><span class="o">,</span> <span class="n">d</span><span class="o">.</span><span class="na">length</span><span class="o">);</span>
        <span class="n">String</span> <span class="n">rs</span> <span class="o">=</span> <span class="n">ccc</span><span class="o">(</span><span class="n">result</span><span class="o">);</span>
        <span class="k">return</span> <span class="n">rs</span><span class="o">;</span>
    <span class="o">}</span>

    <span class="kd">static</span> <span class="kt">byte</span><span class="o">[]</span> <span class="nf">aaa</span><span class="o">(</span><span class="kt">int</span> <span class="n">len</span><span class="o">)</span> <span class="o">{</span>
        <span class="kt">byte</span><span class="o">[]</span> <span class="n">data</span> <span class="o">=</span> <span class="k">new</span> <span class="kt">byte</span><span class="o">[</span><span class="n">len</span><span class="o">];</span>

        <span class="k">for</span><span class="o">(</span><span class="kt">int</span> <span class="n">i</span> <span class="o">=</span> <span class="n">0</span><span class="o">;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="n">len</span><span class="o">;</span> <span class="o">++</span><span class="n">i</span><span class="o">)</span> <span class="o">{</span>
            <span class="n">data</span><span class="o">[</span><span class="n">i</span><span class="o">]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="k">new</span> <span class="n">Random</span><span class="o">()).</span><span class="na">nextInt</span><span class="o">(</span><span class="n">127</span><span class="o">);</span>
        <span class="o">}</span>

        <span class="k">return</span> <span class="n">data</span><span class="o">;</span>
    <span class="o">}</span>


    <span class="kd">public</span> <span class="kd">static</span> <span class="kt">byte</span><span class="o">[]</span> <span class="nf">bbb</span><span class="o">(</span><span class="kt">byte</span><span class="o">[]</span> <span class="n">data</span><span class="o">,</span> <span class="kt">byte</span><span class="o">[]</span> <span class="n">head</span><span class="o">)</span> <span class="kd">throws</span> <span class="n">Exception</span> <span class="o">{</span>
        <span class="n">SecureRandom</span> <span class="n">sr</span> <span class="o">=</span> <span class="k">new</span> <span class="n">SecureRandom</span><span class="o">();</span>
        <span class="n">DESKeySpec</span> <span class="n">dks</span> <span class="o">=</span> <span class="k">new</span> <span class="n">DESKeySpec</span><span class="o">(</span><span class="n">kkk</span><span class="o">(</span><span class="n">head</span><span class="o">));</span>
        <span class="n">SecretKeyFactory</span> <span class="n">keyFactory</span> <span class="o">=</span> <span class="n">SecretKeyFactory</span><span class="o">.</span><span class="na">getInstance</span><span class="o">(</span><span class="s">&#34;DES&#34;</span><span class="o">);</span>
        <span class="n">SecretKey</span> <span class="n">securekey</span> <span class="o">=</span> <span class="n">keyFactory</span><span class="o">.</span><span class="na">generateSecret</span><span class="o">(</span><span class="n">dks</span><span class="o">);</span>
        <span class="n">Cipher</span> <span class="n">cipher</span> <span class="o">=</span> <span class="n">Cipher</span><span class="o">.</span><span class="na">getInstance</span><span class="o">(</span><span class="s">&#34;DES&#34;</span><span class="o">);</span>
        <span class="n">cipher</span><span class="o">.</span><span class="na">init</span><span class="o">(</span><span class="n">1</span><span class="o">,</span> <span class="n">securekey</span><span class="o">,</span> <span class="n">sr</span><span class="o">);</span>
        <span class="k">return</span> <span class="n">cipher</span><span class="o">.</span><span class="na">doFinal</span><span class="o">(</span><span class="n">data</span><span class="o">);</span>
    <span class="o">}</span>

    <span class="kd">public</span> <span class="kd">static</span> <span class="n">String</span> <span class="nf">ccc</span><span class="o">(</span><span class="kt">byte</span><span class="o">[]</span> <span class="n">byteData</span><span class="o">)</span> <span class="kd">throws</span> <span class="n">UnsupportedEncodingException</span> <span class="o">{</span>
        <span class="k">return</span> <span class="n">ddd</span><span class="o">(</span><span class="n">byteData</span><span class="o">,</span> <span class="s">&#34;UTF-8&#34;</span><span class="o">);</span>
    <span class="o">}</span>

    <span class="kd">public</span> <span class="kd">static</span> <span class="n">String</span> <span class="nf">ddd</span><span class="o">(</span><span class="kt">byte</span><span class="o">[]</span> <span class="n">byteData</span><span class="o">,</span> <span class="n">String</span> <span class="n">encoding</span><span class="o">)</span> <span class="kd">throws</span> <span class="n">UnsupportedEncodingException</span> <span class="o">{</span>
        <span class="k">if</span> <span class="o">(</span><span class="n">byteData</span> <span class="o">==</span> <span class="kc">null</span><span class="o">)</span> <span class="o">{</span>
            <span class="k">throw</span> <span class="k">new</span> <span class="n">IllegalArgumentException</span><span class="o">(</span><span class="s">&#34;byteData cannot be null&#34;</span><span class="o">);</span>
        <span class="o">}</span> <span class="k">else</span> <span class="o">{</span>
            <span class="k">return</span> <span class="k">new</span> <span class="n">String</span><span class="o">(</span><span class="n">eee</span><span class="o">(</span><span class="n">byteData</span><span class="o">),</span> <span class="n">encoding</span><span class="o">);</span>
        <span class="o">}</span>
    <span class="o">}</span>
    <span class="kd">public</span> <span class="kd">static</span> <span class="kd">final</span> <span class="kt">byte</span><span class="o">[]</span> <span class="nf">eee</span><span class="o">(</span><span class="kt">byte</span><span class="o">[]</span> <span class="n">byteData</span><span class="o">)</span> <span class="o">{</span>
        <span class="k">if</span> <span class="o">(</span><span class="n">byteData</span> <span class="o">==</span> <span class="kc">null</span><span class="o">)</span> <span class="o">{</span>
            <span class="k">throw</span> <span class="k">new</span> <span class="n">IllegalArgumentException</span><span class="o">(</span><span class="s">&#34;byteData cannot be null&#34;</span><span class="o">);</span>
        <span class="o">}</span> <span class="k">else</span> <span class="o">{</span>
            <span class="kt">byte</span><span class="o">[]</span> <span class="n">byteDest</span> <span class="o">=</span> <span class="k">new</span> <span class="kt">byte</span><span class="o">[(</span><span class="n">byteData</span><span class="o">.</span><span class="na">length</span> <span class="o">+</span> <span class="n">2</span><span class="o">)</span> <span class="o">/</span> <span class="n">3</span> <span class="o">*</span> <span class="n">4</span><span class="o">];</span>
            <span class="kt">int</span> <span class="n">iSrcIdx</span> <span class="o">=</span> <span class="n">0</span><span class="o">;</span>

            <span class="kt">int</span> <span class="n">iDestIdx</span><span class="o">;</span>
            <span class="k">for</span><span class="o">(</span><span class="n">iDestIdx</span> <span class="o">=</span> <span class="n">0</span><span class="o">;</span> <span class="n">iSrcIdx</span> <span class="o">&lt;</span> <span class="n">byteData</span><span class="o">.</span><span class="na">length</span> <span class="o">-</span> <span class="n">2</span><span class="o">;</span> <span class="n">iSrcIdx</span> <span class="o">+=</span> <span class="n">3</span><span class="o">)</span> <span class="o">{</span>
                <span class="n">byteDest</span><span class="o">[</span><span class="n">iDestIdx</span><span class="o">++]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteData</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">&gt;&gt;&gt;</span> <span class="n">2</span> <span class="o">&amp;</span> <span class="n">63</span><span class="o">);</span>
                <span class="n">byteDest</span><span class="o">[</span><span class="n">iDestIdx</span><span class="o">++]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteData</span><span class="o">[</span><span class="n">iSrcIdx</span> <span class="o">+</span> <span class="n">1</span><span class="o">]</span> <span class="o">&gt;&gt;&gt;</span> <span class="n">4</span> <span class="o">&amp;</span> <span class="n">15</span> <span class="o">|</span> <span class="n">byteData</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">&lt;&lt;</span> <span class="n">4</span> <span class="o">&amp;</span> <span class="n">63</span><span class="o">);</span>
                <span class="n">byteDest</span><span class="o">[</span><span class="n">iDestIdx</span><span class="o">++]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteData</span><span class="o">[</span><span class="n">iSrcIdx</span> <span class="o">+</span> <span class="n">2</span><span class="o">]</span> <span class="o">&gt;&gt;&gt;</span> <span class="n">6</span> <span class="o">&amp;</span> <span class="n">3</span> <span class="o">|</span> <span class="n">byteData</span><span class="o">[</span><span class="n">iSrcIdx</span> <span class="o">+</span> <span class="n">1</span><span class="o">]</span> <span class="o">&lt;&lt;</span> <span class="n">2</span> <span class="o">&amp;</span> <span class="n">63</span><span class="o">);</span>
                <span class="n">byteDest</span><span class="o">[</span><span class="n">iDestIdx</span><span class="o">++]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteData</span><span class="o">[</span><span class="n">iSrcIdx</span> <span class="o">+</span> <span class="n">2</span><span class="o">]</span> <span class="o">&amp;</span> <span class="n">63</span><span class="o">);</span>
            <span class="o">}</span>

            <span class="k">if</span> <span class="o">(</span><span class="n">iSrcIdx</span> <span class="o">&lt;</span> <span class="n">byteData</span><span class="o">.</span><span class="na">length</span><span class="o">)</span> <span class="o">{</span>
                <span class="n">byteDest</span><span class="o">[</span><span class="n">iDestIdx</span><span class="o">++]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteData</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">&gt;&gt;&gt;</span> <span class="n">2</span> <span class="o">&amp;</span> <span class="n">63</span><span class="o">);</span>
                <span class="k">if</span> <span class="o">(</span><span class="n">iSrcIdx</span> <span class="o">&lt;</span> <span class="n">byteData</span><span class="o">.</span><span class="na">length</span> <span class="o">-</span> <span class="n">1</span><span class="o">)</span> <span class="o">{</span>
                    <span class="n">byteDest</span><span class="o">[</span><span class="n">iDestIdx</span><span class="o">++]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteData</span><span class="o">[</span><span class="n">iSrcIdx</span> <span class="o">+</span> <span class="n">1</span><span class="o">]</span> <span class="o">&gt;&gt;&gt;</span> <span class="n">4</span> <span class="o">&amp;</span> <span class="n">15</span> <span class="o">|</span> <span class="n">byteData</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">&lt;&lt;</span> <span class="n">4</span> <span class="o">&amp;</span> <span class="n">63</span><span class="o">);</span>
                    <span class="n">byteDest</span><span class="o">[</span><span class="n">iDestIdx</span><span class="o">++]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteData</span><span class="o">[</span><span class="n">iSrcIdx</span> <span class="o">+</span> <span class="n">1</span><span class="o">]</span> <span class="o">&lt;&lt;</span> <span class="n">2</span> <span class="o">&amp;</span> <span class="n">63</span><span class="o">);</span>
                <span class="o">}</span> <span class="k">else</span> <span class="o">{</span>
                    <span class="n">byteDest</span><span class="o">[</span><span class="n">iDestIdx</span><span class="o">++]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteData</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">&lt;&lt;</span> <span class="n">4</span> <span class="o">&amp;</span> <span class="n">63</span><span class="o">);</span>
                <span class="o">}</span>
            <span class="o">}</span>

            <span class="k">for</span><span class="o">(</span><span class="n">iSrcIdx</span> <span class="o">=</span> <span class="n">0</span><span class="o">;</span> <span class="n">iSrcIdx</span> <span class="o">&lt;</span> <span class="n">iDestIdx</span><span class="o">;</span> <span class="o">++</span><span class="n">iSrcIdx</span><span class="o">)</span> <span class="o">{</span>
                <span class="k">if</span> <span class="o">(</span><span class="n">byteDest</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">&lt;</span> <span class="n">26</span><span class="o">)</span> <span class="o">{</span>
                    <span class="n">byteDest</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteDest</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">+</span> <span class="n">65</span><span class="o">);</span>
                <span class="o">}</span> <span class="k">else</span> <span class="k">if</span> <span class="o">(</span><span class="n">byteDest</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">&lt;</span> <span class="n">52</span><span class="o">)</span> <span class="o">{</span>
                    <span class="n">byteDest</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteDest</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">+</span> <span class="n">97</span> <span class="o">-</span> <span class="n">26</span><span class="o">);</span>
                <span class="o">}</span> <span class="k">else</span> <span class="k">if</span> <span class="o">(</span><span class="n">byteDest</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">&lt;</span> <span class="n">62</span><span class="o">)</span> <span class="o">{</span>
                    <span class="n">byteDest</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteDest</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">+</span> <span class="n">48</span> <span class="o">-</span> <span class="n">52</span><span class="o">);</span>
                <span class="o">}</span> <span class="k">else</span> <span class="k">if</span> <span class="o">(</span><span class="n">byteDest</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">&lt;</span> <span class="n">63</span><span class="o">)</span> <span class="o">{</span>
                    <span class="n">byteDest</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">=</span> <span class="n">43</span><span class="o">;</span>
                <span class="o">}</span> <span class="k">else</span> <span class="o">{</span>
                    <span class="n">byteDest</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">=</span> <span class="n">47</span><span class="o">;</span>
                <span class="o">}</span>
            <span class="o">}</span>

            <span class="k">while</span><span class="o">(</span><span class="n">iSrcIdx</span> <span class="o">&lt;</span> <span class="n">byteDest</span><span class="o">.</span><span class="na">length</span><span class="o">)</span> <span class="o">{</span>
                <span class="n">byteDest</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">=</span> <span class="n">61</span><span class="o">;</span>
                <span class="o">++</span><span class="n">iSrcIdx</span><span class="o">;</span>
            <span class="o">}</span>

            <span class="k">return</span> <span class="n">byteDest</span><span class="o">;</span>
        <span class="o">}</span>
    <span class="o">}</span>
    <span class="kd">public</span> <span class="kd">static</span> <span class="kt">boolean</span> <span class="nf">fff</span><span class="o">(</span><span class="n">String</span> <span class="n">str</span><span class="o">)</span> <span class="o">{</span>
        <span class="k">if</span> <span class="o">(</span><span class="n">str</span> <span class="o">==</span> <span class="kc">null</span><span class="o">)</span> <span class="o">{</span>
            <span class="k">return</span> <span class="kc">true</span><span class="o">;</span>
        <span class="o">}</span> <span class="k">else</span> <span class="o">{</span>
            <span class="n">String</span> <span class="n">s2</span> <span class="o">=</span> <span class="n">str</span><span class="o">.</span><span class="na">trim</span><span class="o">();</span>
            <span class="k">return</span> <span class="n">s2</span><span class="o">.</span><span class="na">equals</span><span class="o">(</span><span class="s">&#34;&#34;</span><span class="o">);</span>
        <span class="o">}</span>
    <span class="o">}</span>
    <span class="kd">public</span> <span class="kd">static</span> <span class="kd">final</span> <span class="kt">byte</span><span class="o">[]</span> <span class="nf">ggg</span><span class="o">(</span><span class="n">String</span> <span class="n">encoded</span><span class="o">)</span> <span class="kd">throws</span> <span class="n">UnsupportedEncodingException</span> <span class="o">{</span>
        <span class="k">return</span> <span class="n">hhh</span><span class="o">(</span><span class="n">encoded</span><span class="o">,</span> <span class="s">&#34;UTF-8&#34;</span><span class="o">);</span>
    <span class="o">}</span>
    <span class="kd">public</span> <span class="kd">static</span> <span class="kd">final</span> <span class="kt">byte</span><span class="o">[]</span> <span class="nf">hhh</span><span class="o">(</span><span class="n">String</span> <span class="n">encoded</span><span class="o">,</span> <span class="n">String</span> <span class="n">encoding</span><span class="o">)</span> <span class="kd">throws</span> <span class="n">IllegalArgumentException</span><span class="o">,</span> <span class="n">UnsupportedEncodingException</span> <span class="o">{</span>
        <span class="k">if</span> <span class="o">(</span><span class="n">encoded</span> <span class="o">==</span> <span class="kc">null</span><span class="o">)</span> <span class="o">{</span>
            <span class="k">throw</span> <span class="k">new</span> <span class="n">IllegalArgumentException</span><span class="o">(</span><span class="s">&#34;encoded cannot be null&#34;</span><span class="o">);</span>
        <span class="o">}</span> <span class="k">else</span> <span class="o">{</span>
            <span class="k">return</span> <span class="n">iii</span><span class="o">(</span><span class="n">encoded</span><span class="o">.</span><span class="na">getBytes</span><span class="o">(</span><span class="n">encoding</span><span class="o">));</span>
        <span class="o">}</span>
    <span class="o">}</span>
    <span class="kd">public</span> <span class="kd">static</span> <span class="kd">final</span> <span class="kt">byte</span><span class="o">[]</span> <span class="nf">iii</span><span class="o">(</span><span class="kt">byte</span><span class="o">[]</span> <span class="n">byteData</span><span class="o">)</span> <span class="kd">throws</span> <span class="n">IllegalArgumentException</span> <span class="o">{</span>
        <span class="k">if</span> <span class="o">(</span><span class="n">byteData</span> <span class="o">==</span> <span class="kc">null</span><span class="o">)</span> <span class="o">{</span>
            <span class="k">throw</span> <span class="k">new</span> <span class="n">IllegalArgumentException</span><span class="o">(</span><span class="s">&#34;byteData cannot be null&#34;</span><span class="o">);</span>
        <span class="o">}</span> <span class="k">else</span> <span class="o">{</span>
            <span class="kt">byte</span><span class="o">[]</span> <span class="n">byteTemp</span> <span class="o">=</span> <span class="k">new</span> <span class="kt">byte</span><span class="o">[</span><span class="n">byteData</span><span class="o">.</span><span class="na">length</span><span class="o">];</span>

            <span class="kt">int</span> <span class="n">reviSrcIdx</span><span class="o">;</span>
            <span class="k">for</span><span class="o">(</span><span class="n">reviSrcIdx</span> <span class="o">=</span> <span class="n">byteData</span><span class="o">.</span><span class="na">length</span><span class="o">;</span> <span class="n">reviSrcIdx</span> <span class="o">-</span> <span class="n">1</span> <span class="o">&gt;</span> <span class="n">0</span> <span class="o">&amp;&amp;</span> <span class="n">byteData</span><span class="o">[</span><span class="n">reviSrcIdx</span> <span class="o">-</span> <span class="n">1</span><span class="o">]</span> <span class="o">==</span> <span class="n">61</span><span class="o">;</span> <span class="o">--</span><span class="n">reviSrcIdx</span><span class="o">)</span> <span class="o">{</span>
            <span class="o">}</span>

            <span class="k">if</span> <span class="o">(</span><span class="n">reviSrcIdx</span> <span class="o">-</span> <span class="n">1</span> <span class="o">==</span> <span class="n">0</span><span class="o">)</span> <span class="o">{</span>
                <span class="k">return</span> <span class="kc">null</span><span class="o">;</span>
            <span class="o">}</span> <span class="k">else</span> <span class="o">{</span>
                <span class="kt">byte</span><span class="o">[]</span> <span class="n">byteDest</span> <span class="o">=</span> <span class="k">new</span> <span class="kt">byte</span><span class="o">[</span><span class="n">reviSrcIdx</span> <span class="o">*</span> <span class="n">3</span> <span class="o">/</span> <span class="n">4</span><span class="o">];</span>

                <span class="kt">int</span> <span class="n">iSrcIdx</span><span class="o">;</span>
                <span class="k">for</span><span class="o">(</span><span class="n">iSrcIdx</span> <span class="o">=</span> <span class="n">0</span><span class="o">;</span> <span class="n">iSrcIdx</span> <span class="o">&lt;</span> <span class="n">reviSrcIdx</span><span class="o">;</span> <span class="o">++</span><span class="n">iSrcIdx</span><span class="o">)</span> <span class="o">{</span>
                    <span class="k">if</span> <span class="o">(</span><span class="n">byteData</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">==</span> <span class="n">43</span><span class="o">)</span> <span class="o">{</span>
                        <span class="n">byteTemp</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">=</span> <span class="n">62</span><span class="o">;</span>
                    <span class="o">}</span> <span class="k">else</span> <span class="k">if</span> <span class="o">(</span><span class="n">byteData</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">==</span> <span class="n">47</span><span class="o">)</span> <span class="o">{</span>
                        <span class="n">byteTemp</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">=</span> <span class="n">63</span><span class="o">;</span>
                    <span class="o">}</span> <span class="k">else</span> <span class="k">if</span> <span class="o">(</span><span class="n">byteData</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">&lt;</span> <span class="n">58</span><span class="o">)</span> <span class="o">{</span>
                        <span class="n">byteTemp</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteData</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">+</span> <span class="n">52</span> <span class="o">-</span> <span class="n">48</span><span class="o">);</span>
                    <span class="o">}</span> <span class="k">else</span> <span class="k">if</span> <span class="o">(</span><span class="n">byteData</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">&lt;</span> <span class="n">91</span><span class="o">)</span> <span class="o">{</span>
                        <span class="n">byteTemp</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteData</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">-</span> <span class="n">65</span><span class="o">);</span>
                    <span class="o">}</span> <span class="k">else</span> <span class="k">if</span> <span class="o">(</span><span class="n">byteData</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">&lt;</span> <span class="n">123</span><span class="o">)</span> <span class="o">{</span>
                        <span class="n">byteTemp</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteData</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">+</span> <span class="n">26</span> <span class="o">-</span> <span class="n">97</span><span class="o">);</span>
                    <span class="o">}</span>
                <span class="o">}</span>

                <span class="n">iSrcIdx</span> <span class="o">=</span> <span class="n">0</span><span class="o">;</span>

                <span class="kt">int</span> <span class="n">iDestIdx</span><span class="o">;</span>
                <span class="k">for</span><span class="o">(</span><span class="n">iDestIdx</span> <span class="o">=</span> <span class="n">0</span><span class="o">;</span> <span class="n">iSrcIdx</span> <span class="o">&lt;</span> <span class="n">reviSrcIdx</span> <span class="o">&amp;&amp;</span> <span class="n">iDestIdx</span> <span class="o">&lt;</span> <span class="n">byteDest</span><span class="o">.</span><span class="na">length</span> <span class="o">/</span> <span class="n">3</span> <span class="o">*</span> <span class="n">3</span><span class="o">;</span> <span class="n">iSrcIdx</span> <span class="o">+=</span> <span class="n">4</span><span class="o">)</span> <span class="o">{</span>
                    <span class="n">byteDest</span><span class="o">[</span><span class="n">iDestIdx</span><span class="o">++]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteTemp</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">&lt;&lt;</span> <span class="n">2</span> <span class="o">&amp;</span> <span class="n">252</span> <span class="o">|</span> <span class="n">byteTemp</span><span class="o">[</span><span class="n">iSrcIdx</span> <span class="o">+</span> <span class="n">1</span><span class="o">]</span> <span class="o">&gt;&gt;&gt;</span> <span class="n">4</span> <span class="o">&amp;</span> <span class="n">3</span><span class="o">);</span>
                    <span class="n">byteDest</span><span class="o">[</span><span class="n">iDestIdx</span><span class="o">++]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteTemp</span><span class="o">[</span><span class="n">iSrcIdx</span> <span class="o">+</span> <span class="n">1</span><span class="o">]</span> <span class="o">&lt;&lt;</span> <span class="n">4</span> <span class="o">&amp;</span> <span class="n">240</span> <span class="o">|</span> <span class="n">byteTemp</span><span class="o">[</span><span class="n">iSrcIdx</span> <span class="o">+</span> <span class="n">2</span><span class="o">]</span> <span class="o">&gt;&gt;&gt;</span> <span class="n">2</span> <span class="o">&amp;</span> <span class="n">15</span><span class="o">);</span>
                    <span class="n">byteDest</span><span class="o">[</span><span class="n">iDestIdx</span><span class="o">++]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteTemp</span><span class="o">[</span><span class="n">iSrcIdx</span> <span class="o">+</span> <span class="n">2</span><span class="o">]</span> <span class="o">&lt;&lt;</span> <span class="n">6</span> <span class="o">&amp;</span> <span class="n">192</span> <span class="o">|</span> <span class="n">byteTemp</span><span class="o">[</span><span class="n">iSrcIdx</span> <span class="o">+</span> <span class="n">3</span><span class="o">]</span> <span class="o">&amp;</span> <span class="n">63</span><span class="o">);</span>
                <span class="o">}</span>

                <span class="k">if</span> <span class="o">(</span><span class="n">iSrcIdx</span> <span class="o">&lt;</span> <span class="n">reviSrcIdx</span><span class="o">)</span> <span class="o">{</span>
                    <span class="k">if</span> <span class="o">(</span><span class="n">iSrcIdx</span> <span class="o">&lt;</span> <span class="n">reviSrcIdx</span> <span class="o">-</span> <span class="n">2</span><span class="o">)</span> <span class="o">{</span>
                        <span class="n">byteDest</span><span class="o">[</span><span class="n">iDestIdx</span><span class="o">++]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteTemp</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">&lt;&lt;</span> <span class="n">2</span> <span class="o">&amp;</span> <span class="n">252</span> <span class="o">|</span> <span class="n">byteTemp</span><span class="o">[</span><span class="n">iSrcIdx</span> <span class="o">+</span> <span class="n">1</span><span class="o">]</span> <span class="o">&gt;&gt;&gt;</span> <span class="n">4</span> <span class="o">&amp;</span> <span class="n">3</span><span class="o">);</span>
                        <span class="n">byteDest</span><span class="o">[</span><span class="n">iDestIdx</span><span class="o">++]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteTemp</span><span class="o">[</span><span class="n">iSrcIdx</span> <span class="o">+</span> <span class="n">1</span><span class="o">]</span> <span class="o">&lt;&lt;</span> <span class="n">4</span> <span class="o">&amp;</span> <span class="n">240</span> <span class="o">|</span> <span class="n">byteTemp</span><span class="o">[</span><span class="n">iSrcIdx</span> <span class="o">+</span> <span class="n">2</span><span class="o">]</span> <span class="o">&gt;&gt;&gt;</span> <span class="n">2</span> <span class="o">&amp;</span> <span class="n">15</span><span class="o">);</span>
                    <span class="o">}</span> <span class="k">else</span> <span class="o">{</span>
                        <span class="k">if</span> <span class="o">(</span><span class="n">iSrcIdx</span> <span class="o">&gt;=</span> <span class="n">reviSrcIdx</span> <span class="o">-</span> <span class="n">1</span><span class="o">)</span> <span class="o">{</span>
                            <span class="k">throw</span> <span class="k">new</span> <span class="n">IllegalArgumentException</span><span class="o">(</span><span class="s">&#34;Warning: 1 input bytes left to process. This was not Base64 input&#34;</span><span class="o">);</span>
                        <span class="o">}</span>

                        <span class="n">byteDest</span><span class="o">[</span><span class="n">iDestIdx</span><span class="o">++]</span> <span class="o">=</span> <span class="o">(</span><span class="kt">byte</span><span class="o">)(</span><span class="n">byteTemp</span><span class="o">[</span><span class="n">iSrcIdx</span><span class="o">]</span> <span class="o">&lt;&lt;</span> <span class="n">2</span> <span class="o">&amp;</span> <span class="n">252</span> <span class="o">|</span> <span class="n">byteTemp</span><span class="o">[</span><span class="n">iSrcIdx</span> <span class="o">+</span> <span class="n">1</span><span class="o">]</span> <span class="o">&gt;&gt;&gt;</span> <span class="n">4</span> <span class="o">&amp;</span> <span class="n">3</span><span class="o">);</span>
                    <span class="o">}</span>
                <span class="o">}</span>

                <span class="k">return</span> <span class="n">byteDest</span><span class="o">;</span>
            <span class="o">}</span>
        <span class="o">}</span>
    <span class="o">}</span>
    <span class="kd">public</span> <span class="kd">static</span> <span class="kt">byte</span><span class="o">[]</span> <span class="nf">jjj</span><span class="o">(</span><span class="kt">byte</span><span class="o">[]</span> <span class="n">data</span><span class="o">,</span> <span class="kt">byte</span><span class="o">[]</span> <span class="n">key</span><span class="o">)</span> <span class="kd">throws</span> <span class="n">Exception</span> <span class="o">{</span>
        <span class="n">SecureRandom</span> <span class="n">sr</span> <span class="o">=</span> <span class="k">new</span> <span class="n">SecureRandom</span><span class="o">();</span>
        <span class="n">DESKeySpec</span> <span class="n">dks</span> <span class="o">=</span> <span class="k">new</span> <span class="n">DESKeySpec</span><span class="o">(</span><span class="n">key</span><span class="o">);</span>
        <span class="n">SecretKeyFactory</span> <span class="n">keyFactory</span> <span class="o">=</span> <span class="n">SecretKeyFactory</span><span class="o">.</span><span class="na">getInstance</span><span class="o">(</span><span class="s">&#34;DES&#34;</span><span class="o">);</span>
        <span class="n">SecretKey</span> <span class="n">securekey</span> <span class="o">=</span> <span class="n">keyFactory</span><span class="o">.</span><span class="na">generateSecret</span><span class="o">(</span><span class="n">dks</span><span class="o">);</span>
        <span class="n">Cipher</span> <span class="n">cipher</span> <span class="o">=</span> <span class="n">Cipher</span><span class="o">.</span><span class="na">getInstance</span><span class="o">(</span><span class="s">&#34;DES&#34;</span><span class="o">);</span>
        <span class="n">cipher</span><span class="o">.</span><span class="na">init</span><span class="o">(</span><span class="n">2</span><span class="o">,</span> <span class="n">securekey</span><span class="o">,</span> <span class="n">sr</span><span class="o">);</span>
        <span class="k">return</span> <span class="n">cipher</span><span class="o">.</span><span class="na">doFinal</span><span class="o">(</span><span class="n">data</span><span class="o">);</span>
    <span class="o">}</span>

    <span class="kd">static</span> <span class="kt">byte</span><span class="o">[]</span> <span class="nf">kkk</span><span class="o">(</span><span class="kt">byte</span><span class="o">[]</span> <span class="n">head</span><span class="o">)</span> <span class="o">{</span>
        <span class="kt">long</span> <span class="n">ks</span> <span class="o">=</span> <span class="n">number</span> <span class="o">/</span> <span class="o">(</span><span class="kt">long</span><span class="o">)(</span><span class="k">new</span> <span class="n">Random</span><span class="o">((</span><span class="kt">long</span><span class="o">)</span><span class="n">head</span><span class="o">[</span><span class="n">5</span><span class="o">])).</span><span class="na">nextInt</span><span class="o">(</span><span class="n">127</span><span class="o">);</span>
        <span class="n">Random</span> <span class="n">random</span> <span class="o">=</span> <span class="k">new</span> <span class="n">Random</span><span class="o">(</span><span class="n">ks</span><span class="o">);</span>
        <span class="kt">int</span> <span class="n">t</span> <span class="o">=</span> <span class="n">head</span><span class="o">[</span><span class="n">0</span><span class="o">];</span>

        <span class="k">for</span><span class="o">(</span><span class="kt">int</span> <span class="n">i</span> <span class="o">=</span> <span class="n">0</span><span class="o">;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="n">t</span><span class="o">;</span> <span class="o">++</span><span class="n">i</span><span class="o">)</span> <span class="o">{</span>
            <span class="n">random</span><span class="o">.</span><span class="na">nextLong</span><span class="o">();</span>
        <span class="o">}</span>

        <span class="kt">long</span> <span class="n">n</span> <span class="o">=</span> <span class="n">random</span><span class="o">.</span><span class="na">nextLong</span><span class="o">();</span>
        <span class="n">Random</span> <span class="n">r2</span> <span class="o">=</span> <span class="k">new</span> <span class="n">Random</span><span class="o">(</span><span class="n">n</span><span class="o">);</span>
        <span class="kt">long</span><span class="o">[]</span> <span class="n">ld</span> <span class="o">=</span> <span class="k">new</span> <span class="kt">long</span><span class="o">[]{(</span><span class="kt">long</span><span class="o">)</span><span class="n">head</span><span class="o">[</span><span class="n">4</span><span class="o">],</span> <span class="n">r2</span><span class="o">.</span><span class="na">nextLong</span><span class="o">(),</span> <span class="o">(</span><span class="kt">long</span><span class="o">)</span><span class="n">head</span><span class="o">[</span><span class="n">7</span><span class="o">],</span> <span class="o">(</span><span class="kt">long</span><span class="o">)</span><span class="n">head</span><span class="o">[</span><span class="n">3</span><span class="o">],</span> <span class="n">r2</span><span class="o">.</span><span class="na">nextLong</span><span class="o">(),</span> <span class="o">(</span><span class="kt">long</span><span class="o">)</span><span class="n">head</span><span class="o">[</span><span class="n">1</span><span class="o">],</span> <span class="n">random</span><span class="o">.</span><span class="na">nextLong</span><span class="o">(),</span> <span class="o">(</span><span class="kt">long</span><span class="o">)</span><span class="n">head</span><span class="o">[</span><span class="n">2</span><span class="o">]};</span>
        <span class="n">ByteArrayOutputStream</span> <span class="n">bos</span> <span class="o">=</span> <span class="k">new</span> <span class="n">ByteArrayOutputStream</span><span class="o">();</span>
        <span class="n">DataOutputStream</span> <span class="n">dos</span> <span class="o">=</span> <span class="k">new</span> <span class="n">DataOutputStream</span><span class="o">(</span><span class="n">bos</span><span class="o">);</span>
        <span class="kt">long</span><span class="o">[]</span> <span class="n">var15</span> <span class="o">=</span> <span class="n">ld</span><span class="o">;</span>
        <span class="kt">int</span> <span class="n">var14</span> <span class="o">=</span> <span class="n">ld</span><span class="o">.</span><span class="na">length</span><span class="o">;</span>

        <span class="k">for</span><span class="o">(</span><span class="kt">int</span> <span class="n">var13</span> <span class="o">=</span> <span class="n">0</span><span class="o">;</span> <span class="n">var13</span> <span class="o">&lt;</span> <span class="n">var14</span><span class="o">;</span> <span class="o">++</span><span class="n">var13</span><span class="o">)</span> <span class="o">{</span>
            <span class="kt">long</span> <span class="n">l</span> <span class="o">=</span> <span class="n">var15</span><span class="o">[</span><span class="n">var13</span><span class="o">];</span>

            <span class="k">try</span> <span class="o">{</span>
                <span class="n">dos</span><span class="o">.</span><span class="na">writeLong</span><span class="o">(</span><span class="n">l</span><span class="o">);</span>
            <span class="o">}</span> <span class="k">catch</span> <span class="o">(</span><span class="n">IOException</span> <span class="n">var18</span><span class="o">)</span> <span class="o">{</span>
                <span class="n">var18</span><span class="o">.</span><span class="na">printStackTrace</span><span class="o">();</span>
            <span class="o">}</span>
        <span class="o">}</span>

        <span class="k">try</span> <span class="o">{</span>
            <span class="n">dos</span><span class="o">.</span><span class="na">close</span><span class="o">();</span>
        <span class="o">}</span> <span class="k">catch</span> <span class="o">(</span><span class="n">IOException</span> <span class="n">var17</span><span class="o">)</span> <span class="o">{</span>
            <span class="n">var17</span><span class="o">.</span><span class="na">printStackTrace</span><span class="o">();</span>
        <span class="o">}</span>

        <span class="kt">byte</span><span class="o">[]</span> <span class="n">keyData</span> <span class="o">=</span> <span class="n">bos</span><span class="o">.</span><span class="na">toByteArray</span><span class="o">();</span>
        <span class="n">keyData</span> <span class="o">=</span> <span class="n">DigestUtils</span><span class="o">.</span><span class="na">md5</span><span class="o">(</span><span class="n">keyData</span><span class="o">);</span>
        <span class="k">return</span> <span class="n">keyData</span><span class="o">;</span>
    <span class="o">}</span>
<span class="o">}</span>


</code></pre></td></tr></table>
</div>
</div></div><div class="post-footer" id="post-footer">
    <div class="post-info">
        <div class="post-info-line">
            <div class="post-info-mod">
                <span>更新于 2016-10-27</span>
            </div>
            <div class="post-info-license"></div>
        </div>
        <div class="post-info-line">
            <div class="post-info-md"></div>
            <div class="post-info-share">
                <span><a href="javascript:void(0);" title="分享到 Twitter" data-sharer="twitter" data-url="https://scemsjyd.com/finalshell%E8%A7%A3%E5%AF%86/" data-title="01_finalshell密码破解" data-hashtags="finalshell"><i class="fab fa-twitter fa-fw"></i></a><a href="javascript:void(0);" title="分享到 WhatsApp" data-sharer="whatsapp" data-url="https://scemsjyd.com/finalshell%E8%A7%A3%E5%AF%86/" data-title="01_finalshell密码破解" data-web><i class="fab fa-whatsapp fa-fw"></i></a><a href="javascript:void(0);" title="分享到 微博" data-sharer="weibo" data-url="https://scemsjyd.com/finalshell%E8%A7%A3%E5%AF%86/" data-title="01_finalshell密码破解"><i class="fab fa-weibo fa-fw"></i></a><a href="javascript:void(0);" title="分享到 Evernote" data-sharer="evernote" data-url="https://scemsjyd.com/finalshell%E8%A7%A3%E5%AF%86/" data-title="01_finalshell密码破解"><i class="fab fa-evernote fa-fw"></i></a></span>
            </div>
        </div>
    </div>

    <div class="post-info-more">
        <section class="post-tags"><i class="fas fa-tags fa-fw"></i>&nbsp;<a href="/tags/finalshell/">finalshell</a></section>
        <section>
            <span><a href="javascript:void(0);" onclick="window.history.back();">返回</a></span>&nbsp;|&nbsp;<span><a href="/">主页</a></span>
        </section>
    </div>

    <div class="post-nav"><a href="/navicat%E8%A7%A3%E5%AF%86/" class="prev" rel="prev" title="02_navicat密码破解"><i class="fas fa-angle-left fa-fw"></i>02_navicat密码破解</a>
            <a href="/06_springmvc_validator/" class="next" rel="next" title="06_springmvc_validator">06_springmvc_validator<i class="fas fa-angle-right fa-fw"></i></a></div>
</div>
<div id="comments"><div id="valine" class="comment"></div><noscript>
                Please enable JavaScript to view the comments powered by <a href="https://valine.js.org/">Valine</a>.
            </noscript></div></article></div>
            </main><footer class="footer">
        <div class="footer-container"><div class="footer-line"><span><a href='https://www.upyun.com/?utm_source=lianmeng&utm_medium=referral'>本网站由<img style='vertical-align:bottom' width='60' src='/images/upyun.svg'>提供CDN加速/云存储服务</a></span></div><div class="footer-line"><i class="far fa-copyright fa-fw"></i><span itemprop="copyrightYear">2016 - 2022</span><span class="author" itemprop="copyrightHolder">&nbsp;<a href="/" target="_blank">Adam.Jin</a></span>&nbsp;|&nbsp;<span class="license"><a rel="license external nofollow noopener noreffer" href="https://creativecommons.org/licenses/by-nc/4.0/" target="_blank">CC BY-NC 4.0</a></span><span class="icp-splitter">&nbsp;|&nbsp;</span><br class="icp-br"/>
                    <span class="icp"><a href='https://beian.miit.gov.cn/'>蜀ICP备2021027971号-1</a></span></div>
        </div>
    </footer></div>

        <div id="fixed-buttons"><a href="#" id="back-to-top" class="fixed-button" title="回到顶部">
                <i class="fas fa-arrow-up fa-fw"></i>
            </a><a href="#" id="view-comments" class="fixed-button" title="查看评论">
                <i class="fas fa-comment fa-fw"></i>
            </a>
        </div><link rel="stylesheet" href="/lib/valine/valine.min.css"><script type="text/javascript" src="https://cdn.jsdelivr.net/npm/valine@1.4.14/dist/Valine.min.js"></script><script type="text/javascript" src="https://cdn.jsdelivr.net/npm/smooth-scroll@16.1.3/dist/smooth-scroll.min.js"></script><script type="text/javascript" src="https://cdn.jsdelivr.net/npm/autocomplete.js@0.37.1/dist/autocomplete.min.js"></script><script type="text/javascript" src="https://cdn.jsdelivr.net/npm/lunr@2.3.8/lunr.min.js"></script><script type="text/javascript" src="/lib/lunr/lunr.stemmer.support.min.js"></script><script type="text/javascript" src="/lib/lunr/lunr.zh.min.js"></script><script type="text/javascript" src="https://cdn.jsdelivr.net/npm/lazysizes@5.2.2/lazysizes.min.js"></script><script type="text/javascript" src="https://cdn.jsdelivr.net/npm/clipboard@2.0.6/dist/clipboard.min.js"></script><script type="text/javascript" src="https://cdn.jsdelivr.net/npm/sharer.js@0.4.0/sharer.min.js"></script><script type="text/javascript">window.config={"code":{"copyTitle":"复制到剪贴板","maxShownLines":10},"comment":{"valine":{"appId":"NEWqsYTB88Sn8Pq0AsYDaXcn-gzGzoHsz","appKey":"bvPBG3pirvLqtjU6IYVxGIyP","avatar":"mp","el":"#valine","emojiCDN":"https://cdn.jsdelivr.net/npm/emoji-datasource-google@5.0.1/img/google/64/","emojiMaps":{"100":"1f4af.png","alien":"1f47d.png","anger":"1f4a2.png","angry":"1f620.png","anguished":"1f627.png","astonished":"1f632.png","black_heart":"1f5a4.png","blue_heart":"1f499.png","blush":"1f60a.png","bomb":"1f4a3.png","boom":"1f4a5.png","broken_heart":"1f494.png","brown_heart":"1f90e.png","clown_face":"1f921.png","cold_face":"1f976.png","cold_sweat":"1f630.png","confounded":"1f616.png","confused":"1f615.png","cry":"1f622.png","crying_cat_face":"1f63f.png","cupid":"1f498.png","dash":"1f4a8.png","disappointed":"1f61e.png","disappointed_relieved":"1f625.png","dizzy":"1f4ab.png","dizzy_face":"1f635.png","drooling_face":"1f924.png","exploding_head":"1f92f.png","expressionless":"1f611.png","face_vomiting":"1f92e.png","face_with_cowboy_hat":"1f920.png","face_with_hand_over_mouth":"1f92d.png","face_with_head_bandage":"1f915.png","face_with_monocle":"1f9d0.png","face_with_raised_eyebrow":"1f928.png","face_with_rolling_eyes":"1f644.png","face_with_symbols_on_mouth":"1f92c.png","face_with_thermometer":"1f912.png","fearful":"1f628.png","flushed":"1f633.png","frowning":"1f626.png","ghost":"1f47b.png","gift_heart":"1f49d.png","green_heart":"1f49a.png","grimacing":"1f62c.png","grin":"1f601.png","grinning":"1f600.png","hankey":"1f4a9.png","hear_no_evil":"1f649.png","heart":"2764-fe0f.png","heart_decoration":"1f49f.png","heart_eyes":"1f60d.png","heart_eyes_cat":"1f63b.png","heartbeat":"1f493.png","heartpulse":"1f497.png","heavy_heart_exclamation_mark_ornament":"2763-fe0f.png","hole":"1f573-fe0f.png","hot_face":"1f975.png","hugging_face":"1f917.png","hushed":"1f62f.png","imp":"1f47f.png","innocent":"1f607.png","japanese_goblin":"1f47a.png","japanese_ogre":"1f479.png","joy":"1f602.png","joy_cat":"1f639.png","kiss":"1f48b.png","kissing":"1f617.png","kissing_cat":"1f63d.png","kissing_closed_eyes":"1f61a.png","kissing_heart":"1f618.png","kissing_smiling_eyes":"1f619.png","laughing":"1f606.png","left_speech_bubble":"1f5e8-fe0f.png","love_letter":"1f48c.png","lying_face":"1f925.png","mask":"1f637.png","money_mouth_face":"1f911.png","nauseated_face":"1f922.png","nerd_face":"1f913.png","neutral_face":"1f610.png","no_mouth":"1f636.png","open_mouth":"1f62e.png","orange_heart":"1f9e1.png","partying_face":"1f973.png","pensive":"1f614.png","persevere":"1f623.png","pleading_face":"1f97a.png","pouting_cat":"1f63e.png","purple_heart":"1f49c.png","rage":"1f621.png","relaxed":"263a-fe0f.png","relieved":"1f60c.png","revolving_hearts":"1f49e.png","right_anger_bubble":"1f5ef-fe0f.png","robot_face":"1f916.png","rolling_on_the_floor_laughing":"1f923.png","scream":"1f631.png","scream_cat":"1f640.png","see_no_evil":"1f648.png","shushing_face":"1f92b.png","skull":"1f480.png","skull_and_crossbones":"2620-fe0f.png","sleeping":"1f634.png","sleepy":"1f62a.png","slightly_frowning_face":"1f641.png","slightly_smiling_face":"1f642.png","smile":"1f604.png","smile_cat":"1f638.png","smiley":"1f603.png","smiley_cat":"1f63a.png","smiling_face_with_3_hearts":"1f970.png","smiling_imp":"1f608.png","smirk":"1f60f.png","smirk_cat":"1f63c.png","sneezing_face":"1f927.png","sob":"1f62d.png","space_invader":"1f47e.png","sparkling_heart":"1f496.png","speak_no_evil":"1f64a.png","speech_balloon":"1f4ac.png","star-struck":"1f929.png","stuck_out_tongue":"1f61b.png","stuck_out_tongue_closed_eyes":"1f61d.png","stuck_out_tongue_winking_eye":"1f61c.png","sunglasses":"1f60e.png","sweat":"1f613.png","sweat_drops":"1f4a6.png","sweat_smile":"1f605.png","thinking_face":"1f914.png","thought_balloon":"1f4ad.png","tired_face":"1f62b.png","triumph":"1f624.png","two_hearts":"1f495.png","unamused":"1f612.png","upside_down_face":"1f643.png","weary":"1f629.png","white_frowning_face":"2639-fe0f.png","white_heart":"1f90d.png","wink":"1f609.png","woozy_face":"1f974.png","worried":"1f61f.png","yawning_face":"1f971.png","yellow_heart":"1f49b.png","yum":"1f60b.png","zany_face":"1f92a.png","zipper_mouth_face":"1f910.png","zzz":"1f4a4.png"},"enableQQ":false,"highlight":true,"lang":"zh-cn","pageSize":10,"placeholder":"你的评论 ...","recordIP":true,"serverURLs":"https://newqsytb.lc-cn-n1-shared.com","visitor":true}},"search":{"highlightTag":"em","lunrIndexURL":"/index.json","lunrLanguageCode":"zh","lunrSegmentitURL":"/lib/lunr/lunr.segmentit.js","maxResultLength":10,"noResultsFound":"没有找到结果","snippetLength":50,"type":"lunr"}};</script><script type="text/javascript" src="/js/theme.min.js"></script></body>
</html>
